How Important Is the "Mental Map"? - An Empirical Investigation of a Dynamic Graph Layout Algorithm

نویسندگان

  • Helen C. Purchase
  • Eve E. Hoggan
  • Carsten Görg
چکیده

While some research has been performed on the human understanding of static graph layout algorithms, dynamic graph layout algorithms have only recently been developed sufficiently to enable similar investigations. This paper presents the first empirical analysis of a dynamic graph layout algorithm, focusing on the assumption that maintaining the “mental map” between time-slices assists with the comprehension of the evolving graph. The results confirm this assumption with respect to some categories of tasks.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The 'Mental Map' versus 'Static Aesthetic' Compromise in Dynamic Graphs : A User Study

The design of automatic layout algorithms for single graphs is a well established field, and some recent studies show how these algorithms affect human understanding. By contrast, layout algorithms for graphs that change over time are relatively immature, and few studies exist to evaluate their effectiveness empirically. This paper presents two new dynamic graph layout algorithms and empirical ...

متن کامل

Integrative Cell Formation and Layout Design in Cellular Manufacturing Systems

This paper proposes a new integrative view of manufacturing cell formation and both inter-cell and intra-cell layout problems. Cells formation and their popular bi-directional linear layout are determined simultaneously through a Dynamic Programming algorithm (with the objective of minimizing the inter-cell flow cost under a cell size constraint). This Dynamic Programming algorithm is implement...

متن کامل

Applying Genetic Algorithm to Dynamic Layout Problem

In today’s economy, manufacturing plants must be able to operate efficiently and respond quickly to changes in the product mix and demand.[1] Layout design has a significant impact on manufacturing efficiency. Initially, it was treated as a static decision but due to improvements in technology, it is possible to rearrange the manufacturing facilities in different scenarios. The Plant layout...

متن کامل

A simulated annealing algorithm to determine a group layout and production plan in a dynamic cellular manufacturing system

In this paper, a mixed-integer linearized programming (MINLP) model is presented to design a group layout (GL) of a cellular manufacturing system (CMS) in a dynamic environment with considering production planning (PP) decisions. This model incorporates with an extensive coverage of important manufacturing features used in the design of CMSs. There are also some features that make the presented...

متن کامل

A Tunned-parameter Hybrid Algorithm for Dynamic Facility Layout Problem with Budget Constraint using GA and SAA

A facility layout problem is concerned with determining the best position of departments, cells, or machines on the plant. An efficient layout contributes to the overall efficiency of operations. It’s been proved that, when system characteristics change, it can cause a significant increase in material handling cost. Consequently, the efficiency of the current layout decreases or is lost and it ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006